A Modified Ant Colony Optimization Algorithm for Tumor Marker Gene Selection
نویسندگان
چکیده
منابع مشابه
A Modified Ant Colony Optimization Algorithm for Tumor Marker Gene Selection
Microarray data are often extremely asymmetric in dimensionality, such as thousands or even tens of thousands of genes but only a few hundreds of samples or less. Such extreme asymmetry between the dimensionality of genes and samples can lead to inaccurate diagnosis of disease in clinic. Therefore, it has been shown that selecting a small set of marker genes can lead to improved classification ...
متن کاملA modified ant colony optimization algorithm for virtual network embedding
Traditional Internet architecture is far too rigid for use with large numbers of network applications with different quality of service requirements. One new and promising approach to overcome the rigidity is network virtualization (NV), which allows multiple heterogeneous virtual networks to coexist on a shared substrate network (SN). However, one of the key problems for NV is the virtual netw...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملMulti-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm
In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
متن کاملModified Ant Colony Optimization Algorithm for Travelling Salesman Problem
Limited amount of time and computational resources in industrial domain makes Ant Colony Optimization (ACO) a useful approach to find near optimal solutions in polynomial time for Nondeterministic Polynomial time (NP) problems. For dynamically changing graphs, such as in case of network routing and urban transportation systems which are based on Travelling Salesman Problem (TSP), the ant colony...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genomics, Proteomics & Bioinformatics
سال: 2009
ISSN: 1672-0229
DOI: 10.1016/s1672-0229(08)60050-9